Combining VNDS with Soft Global Constraints Filtering for Solving NRPs
نویسندگان
چکیده
Nurse Rostering Problems (NRPs) consist of generating rosters where required shifts are assigned to nurses over a scheduling period satisfying a number of constraints. In [25], we have shown how soft global constraints can be used to model NRPs in a concise and elegant way. In this paper we go one step further by proposing new neighborhood heuristics for VNS/LDS+CP. Experiments show that, despite its genericity and flexibility, our approach supplies excellent results on small and middle size problems and very promising results on large scale problems.
منابع مشابه
Contractibility for open global constraints
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved, and fit naturally within constraint logic programming. However, in general, filtering that is sound for a global constraint can be unso...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملGlobal Constraints and Filtering Algorithms
Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldiff and the global cardinal...
متن کاملGlobal Constraints
Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldiff and the global cardinal...
متن کاملOpen Contractible Global Constraints
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved. However, in general, filtering that is sound for a global constraint can be unsound when the constraint is open. This paper provides a ...
متن کامل